Improving Statistical Properties of Number Sequences Generated by Multiplicative Congruential Pseudorandom Generator
نویسنده
چکیده
A new method of improving the properties of number sequences produced by a multiplicative congruential pseudorandom generator (MCPG) was proposed. The characteristic feature of the method is the simultaneous usage of numbers generated by the sawtooth chaotic map, realized in a finitestate machine, and symbols produced by the same map. The period of generated sequences can be significantly longer than the period of sequences produced by a multiplicative congruential pseudorandom generator realized in the same machine. It is shown that sequences obtained with the use of the proposed method pass all statistical tests from the standard NIST statistical test suite v.1.8.
منابع مشابه
Multiplicative Character Sums with Counter-Dependent Nonlinear Congruential Pseudorandom Number Generators
Nonlinear congruential pseudorandom number generators can have unexpectedly short periods. Shamir and Tsaban introduced the class of counter-dependent generators which admit much longer periods. In this paper we present a bound for multiplicative character sums for nonlinear sequences generated by counter-dependent generators.
متن کاملOn Generalized Inversive Congruential Pseudorandom Numbers
The inversive congruential method with prime modulus for generating uniform pseudorandom numbers has several very promising properties. Very recently, a generalization for composite moduli has been introduced. In the present paper it is shown that the generated sequences have very attractive statistical independence properties.
متن کاملStatistical Independence of a New Class of Inversive Congruential Pseudorandom Numbers
Linear congruential pseudorandom numbers show several undesirable regularities which can render them useless for certain stochastic simulations. This was the motivation for important recent developments in nonlinear congruential methods for generating uniform pseudorandom numbers. It is particularly promising to achieve nonlinearity by employing the operation of multiplicative inversion with re...
متن کاملExplicit Inversive Congruential Pseudorandom Numbers with Power of Two Modulus
An explicit version of the inversive congruential method with power of two modulus for generating uniform pseudorandom numbers is introduced. Statistical independence properties of the generated sequences are studied by means of the serial test. The method of proof relies on a detailed analysis of certain exponential sums.
متن کاملMultiplicative Character Sums for Nonlinear Recurring Sequences with Dickson Polynomials
We give new bounds of character sums with sequences of iterations of Dickson polynomials over finite fields. This result is motivated by possible applications of nonlinear congruential pseudorandom number generators.
متن کامل